Termination w.r.t. Q proof of TRS/currying/D3317.trs

Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

app(app(., 1), x) → x
app(app(., x), 1) → x
app(app(., app(i, x)), x) → 1
app(app(., x), app(i, x)) → 1
app(app(., app(i, y)), app(app(., y), z)) → z
app(app(., y), app(app(., app(i, y)), z)) → z
app(app(., app(app(., x), y)), z) → app(app(., x), app(app(., y), z))
app(i, 1) → 1
app(i, app(i, x)) → x
app(i, app(app(., x), y)) → app(app(., app(i, y)), app(i, x))
app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(app(filter, f), nil) → nil
app(app(filter, f), app(app(cons, x), xs)) → app(app(app(app(filter2, app(f, x)), f), x), xs)
app(app(app(app(filter2, true), f), x), xs) → app(app(cons, x), app(app(filter, f), xs))
app(app(app(app(filter2, false), f), x), xs) → app(app(filter, f), xs)

Q is empty.

↳ QTRS

  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

app(app(., 1), x) → x
app(app(., x), 1) → x
app(app(., app(i, x)), x) → 1
app(app(., x), app(i, x)) → 1
app(app(., app(i, y)), app(app(., y), z)) → z
app(app(., y), app(app(., app(i, y)), z)) → z
app(app(., app(app(., x), y)), z) → app(app(., x), app(app(., y), z))
app(i, 1) → 1
app(i, app(i, x)) → x
app(i, app(app(., x), y)) → app(app(., app(i, y)), app(i, x))
app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(app(filter, f), nil) → nil
app(app(filter, f), app(app(cons, x), xs)) → app(app(app(app(filter2, app(f, x)), f), x), xs)
app(app(app(app(filter2, true), f), x), xs) → app(app(cons, x), app(app(filter, f), xs))
app(app(app(app(filter2, false), f), x), xs) → app(app(filter, f), xs)

Q is empty.

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

APP(app(app(app(filter2, true), f), x), xs) → APP(app(filter, f), xs)
APP(i, app(app(., x), y)) → APP(i, y)
APP(app(map, f), app(app(cons, x), xs)) → APP(app(cons, app(f, x)), app(app(map, f), xs))
APP(app(filter, f), app(app(cons, x), xs)) → APP(app(filter2, app(f, x)), f)
APP(i, app(app(., x), y)) → APP(i, x)
APP(app(app(app(filter2, false), f), x), xs) → APP(filter, f)
APP(app(filter, f), app(app(cons, x), xs)) → APP(app(app(filter2, app(f, x)), f), x)
APP(i, app(app(., x), y)) → APP(app(., app(i, y)), app(i, x))
APP(app(filter, f), app(app(cons, x), xs)) → APP(app(app(app(filter2, app(f, x)), f), x), xs)
APP(app(filter, f), app(app(cons, x), xs)) → APP(f, x)
APP(app(map, f), app(app(cons, x), xs)) → APP(app(map, f), xs)
APP(app(app(app(filter2, true), f), x), xs) → APP(app(cons, x), app(app(filter, f), xs))
APP(app(., app(app(., x), y)), z) → APP(app(., y), z)
APP(app(app(app(filter2, true), f), x), xs) → APP(filter, f)
APP(app(., app(app(., x), y)), z) → APP(app(., x), app(app(., y), z))
APP(i, app(app(., x), y)) → APP(., app(i, y))
APP(app(filter, f), app(app(cons, x), xs)) → APP(filter2, app(f, x))
APP(app(map, f), app(app(cons, x), xs)) → APP(f, x)
APP(app(app(app(filter2, true), f), x), xs) → APP(cons, x)
APP(app(app(app(filter2, false), f), x), xs) → APP(app(filter, f), xs)
APP(app(., app(app(., x), y)), z) → APP(., y)
APP(app(map, f), app(app(cons, x), xs)) → APP(cons, app(f, x))

The TRS R consists of the following rules:

app(app(., 1), x) → x
app(app(., x), 1) → x
app(app(., app(i, x)), x) → 1
app(app(., x), app(i, x)) → 1
app(app(., app(i, y)), app(app(., y), z)) → z
app(app(., y), app(app(., app(i, y)), z)) → z
app(app(., app(app(., x), y)), z) → app(app(., x), app(app(., y), z))
app(i, 1) → 1
app(i, app(i, x)) → x
app(i, app(app(., x), y)) → app(app(., app(i, y)), app(i, x))
app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(app(filter, f), nil) → nil
app(app(filter, f), app(app(cons, x), xs)) → app(app(app(app(filter2, app(f, x)), f), x), xs)
app(app(app(app(filter2, true), f), x), xs) → app(app(cons, x), app(app(filter, f), xs))
app(app(app(app(filter2, false), f), x), xs) → app(app(filter, f), xs)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

Q DP problem:
The TRS P consists of the following rules:

APP(app(app(app(filter2, true), f), x), xs) → APP(app(filter, f), xs)
APP(i, app(app(., x), y)) → APP(i, y)
APP(app(map, f), app(app(cons, x), xs)) → APP(app(cons, app(f, x)), app(app(map, f), xs))
APP(app(filter, f), app(app(cons, x), xs)) → APP(app(filter2, app(f, x)), f)
APP(i, app(app(., x), y)) → APP(i, x)
APP(app(app(app(filter2, false), f), x), xs) → APP(filter, f)
APP(app(filter, f), app(app(cons, x), xs)) → APP(app(app(filter2, app(f, x)), f), x)
APP(i, app(app(., x), y)) → APP(app(., app(i, y)), app(i, x))
APP(app(filter, f), app(app(cons, x), xs)) → APP(app(app(app(filter2, app(f, x)), f), x), xs)
APP(app(filter, f), app(app(cons, x), xs)) → APP(f, x)
APP(app(map, f), app(app(cons, x), xs)) → APP(app(map, f), xs)
APP(app(app(app(filter2, true), f), x), xs) → APP(app(cons, x), app(app(filter, f), xs))
APP(app(., app(app(., x), y)), z) → APP(app(., y), z)
APP(app(app(app(filter2, true), f), x), xs) → APP(filter, f)
APP(app(., app(app(., x), y)), z) → APP(app(., x), app(app(., y), z))
APP(i, app(app(., x), y)) → APP(., app(i, y))
APP(app(filter, f), app(app(cons, x), xs)) → APP(filter2, app(f, x))
APP(app(map, f), app(app(cons, x), xs)) → APP(f, x)
APP(app(app(app(filter2, true), f), x), xs) → APP(cons, x)
APP(app(app(app(filter2, false), f), x), xs) → APP(app(filter, f), xs)
APP(app(., app(app(., x), y)), z) → APP(., y)
APP(app(map, f), app(app(cons, x), xs)) → APP(cons, app(f, x))

The TRS R consists of the following rules:

app(app(., 1), x) → x
app(app(., x), 1) → x
app(app(., app(i, x)), x) → 1
app(app(., x), app(i, x)) → 1
app(app(., app(i, y)), app(app(., y), z)) → z
app(app(., y), app(app(., app(i, y)), z)) → z
app(app(., app(app(., x), y)), z) → app(app(., x), app(app(., y), z))
app(i, 1) → 1
app(i, app(i, x)) → x
app(i, app(app(., x), y)) → app(app(., app(i, y)), app(i, x))
app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(app(filter, f), nil) → nil
app(app(filter, f), app(app(cons, x), xs)) → app(app(app(app(filter2, app(f, x)), f), x), xs)
app(app(app(app(filter2, true), f), x), xs) → app(app(cons, x), app(app(filter, f), xs))
app(app(app(app(filter2, false), f), x), xs) → app(app(filter, f), xs)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We deleted some edges using various graph approximations

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

APP(app(app(app(filter2, true), f), x), xs) → APP(app(filter, f), xs)
APP(i, app(app(., x), y)) → APP(i, y)
APP(app(map, f), app(app(cons, x), xs)) → APP(app(cons, app(f, x)), app(app(map, f), xs))
APP(i, app(app(., x), y)) → APP(i, x)
APP(app(filter, f), app(app(cons, x), xs)) → APP(app(filter2, app(f, x)), f)
APP(app(app(app(filter2, false), f), x), xs) → APP(filter, f)
APP(app(filter, f), app(app(cons, x), xs)) → APP(app(app(filter2, app(f, x)), f), x)
APP(app(filter, f), app(app(cons, x), xs)) → APP(app(app(app(filter2, app(f, x)), f), x), xs)
APP(i, app(app(., x), y)) → APP(app(., app(i, y)), app(i, x))
APP(app(map, f), app(app(cons, x), xs)) → APP(app(map, f), xs)
APP(app(filter, f), app(app(cons, x), xs)) → APP(f, x)
APP(app(., app(app(., x), y)), z) → APP(app(., y), z)
APP(app(app(app(filter2, true), f), x), xs) → APP(app(cons, x), app(app(filter, f), xs))
APP(app(app(app(filter2, true), f), x), xs) → APP(filter, f)
APP(app(., app(app(., x), y)), z) → APP(app(., x), app(app(., y), z))
APP(i, app(app(., x), y)) → APP(., app(i, y))
APP(app(map, f), app(app(cons, x), xs)) → APP(f, x)
APP(app(filter, f), app(app(cons, x), xs)) → APP(filter2, app(f, x))
APP(app(app(app(filter2, true), f), x), xs) → APP(cons, x)
APP(app(app(app(filter2, false), f), x), xs) → APP(app(filter, f), xs)
APP(app(map, f), app(app(cons, x), xs)) → APP(cons, app(f, x))
APP(app(., app(app(., x), y)), z) → APP(., y)

The TRS R consists of the following rules:

app(app(., 1), x) → x
app(app(., x), 1) → x
app(app(., app(i, x)), x) → 1
app(app(., x), app(i, x)) → 1
app(app(., app(i, y)), app(app(., y), z)) → z
app(app(., y), app(app(., app(i, y)), z)) → z
app(app(., app(app(., x), y)), z) → app(app(., x), app(app(., y), z))
app(i, 1) → 1
app(i, app(i, x)) → x
app(i, app(app(., x), y)) → app(app(., app(i, y)), app(i, x))
app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(app(filter, f), nil) → nil
app(app(filter, f), app(app(cons, x), xs)) → app(app(app(app(filter2, app(f, x)), f), x), xs)
app(app(app(app(filter2, true), f), x), xs) → app(app(cons, x), app(app(filter, f), xs))
app(app(app(app(filter2, false), f), x), xs) → app(app(filter, f), xs)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 3 SCCs with 12 less nodes.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

                ↳ QDPOrderProof

              ↳ QDP

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

APP(app(., app(app(., x), y)), z) → APP(app(., x), app(app(., y), z))
APP(app(., app(app(., x), y)), z) → APP(app(., y), z)

The TRS R consists of the following rules:

app(app(., 1), x) → x
app(app(., x), 1) → x
app(app(., app(i, x)), x) → 1
app(app(., x), app(i, x)) → 1
app(app(., app(i, y)), app(app(., y), z)) → z
app(app(., y), app(app(., app(i, y)), z)) → z
app(app(., app(app(., x), y)), z) → app(app(., x), app(app(., y), z))
app(i, 1) → 1
app(i, app(i, x)) → x
app(i, app(app(., x), y)) → app(app(., app(i, y)), app(i, x))
app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(app(filter, f), nil) → nil
app(app(filter, f), app(app(cons, x), xs)) → app(app(app(app(filter2, app(f, x)), f), x), xs)
app(app(app(app(filter2, true), f), x), xs) → app(app(cons, x), app(app(filter, f), xs))
app(app(app(app(filter2, false), f), x), xs) → app(app(filter, f), xs)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13]. Here, we combined the reduction pair processor with the A-transformation [14] which results in the following intermediate Q-DP Problem.
Q DP problem:
The TRS P consists of the following rules:

.1(.(x, y), z) → .1(x, .(y, z))
.1(.(x, y), z) → .1(y, z)

The TRS R consists of the following rules:

.(1, x) → x
.(x, 1) → x
.(i(x), x) → 1
.(x, i(x)) → 1
.(i(y), .(y, z)) → z
.(y, .(i(y), z)) → z
.(.(x, y), z) → .(x, .(y, z))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

The following pairs can be oriented strictly and are deleted.

APP(app(., app(app(., x), y)), z) → APP(app(., x), app(app(., y), z))
APP(app(., app(app(., x), y)), z) → APP(app(., y), z)

The remaining pairs can at least be oriented weakly.
none
Used ordering: Combined order from the following AFS and order.
.1(x1, x2) = .1(x1, x2)
.(x1, x2) = .(x1, x2)
i(x1) = i
1 = 1

Lexicographic Path Order [19].
Precedence:

.1₂ > .₂ > 1
i > 1

The following usable rules [14] were oriented:

app(app(., app(app(., x), y)), z) → app(app(., x), app(app(., y), z))
app(app(., app(i, y)), app(app(., y), z)) → z
app(app(., 1), x) → x
app(app(., app(i, x)), x) → 1
app(app(., x), app(i, x)) → 1
app(app(., y), app(app(., app(i, y)), z)) → z
app(app(., x), 1) → x

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ PisEmptyProof

              ↳ QDP

              ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

app(app(., 1), x) → x
app(app(., x), 1) → x
app(app(., app(i, x)), x) → 1
app(app(., x), app(i, x)) → 1
app(app(., app(i, y)), app(app(., y), z)) → z
app(app(., y), app(app(., app(i, y)), z)) → z
app(app(., app(app(., x), y)), z) → app(app(., x), app(app(., y), z))
app(i, 1) → 1
app(i, app(i, x)) → x
app(i, app(app(., x), y)) → app(app(., app(i, y)), app(i, x))
app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(app(filter, f), nil) → nil
app(app(filter, f), app(app(cons, x), xs)) → app(app(app(app(filter2, app(f, x)), f), x), xs)
app(app(app(app(filter2, true), f), x), xs) → app(app(cons, x), app(app(filter, f), xs))
app(app(app(app(filter2, false), f), x), xs) → app(app(filter, f), xs)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

APP(i, app(app(., x), y)) → APP(i, y)
APP(i, app(app(., x), y)) → APP(i, x)

The TRS R consists of the following rules:

app(app(., 1), x) → x
app(app(., x), 1) → x
app(app(., app(i, x)), x) → 1
app(app(., x), app(i, x)) → 1
app(app(., app(i, y)), app(app(., y), z)) → z
app(app(., y), app(app(., app(i, y)), z)) → z
app(app(., app(app(., x), y)), z) → app(app(., x), app(app(., y), z))
app(i, 1) → 1
app(i, app(i, x)) → x
app(i, app(app(., x), y)) → app(app(., app(i, y)), app(i, x))
app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(app(filter, f), nil) → nil
app(app(filter, f), app(app(cons, x), xs)) → app(app(app(app(filter2, app(f, x)), f), x), xs)
app(app(app(app(filter2, true), f), x), xs) → app(app(cons, x), app(app(filter, f), xs))
app(app(app(app(filter2, false), f), x), xs) → app(app(filter, f), xs)

I(.(x, y)) → I(x)
I(.(x, y)) → I(y)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.

The following pairs can be oriented strictly and are deleted.

APP(i, app(app(., x), y)) → APP(i, y)
APP(i, app(app(., x), y)) → APP(i, x)

The remaining pairs can at least be oriented weakly.
none
Used ordering: Combined order from the following AFS and order.
I(x1) = I(x1)
.(x1, x2) = .(x1, x2)

Lexicographic Path Order [19].
Precedence:

.₂ > I₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ PisEmptyProof

              ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

app(app(., 1), x) → x
app(app(., x), 1) → x
app(app(., app(i, x)), x) → 1
app(app(., x), app(i, x)) → 1
app(app(., app(i, y)), app(app(., y), z)) → z
app(app(., y), app(app(., app(i, y)), z)) → z
app(app(., app(app(., x), y)), z) → app(app(., x), app(app(., y), z))
app(i, 1) → 1
app(i, app(i, x)) → x
app(i, app(app(., x), y)) → app(app(., app(i, y)), app(i, x))
app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(app(filter, f), nil) → nil
app(app(filter, f), app(app(cons, x), xs)) → app(app(app(app(filter2, app(f, x)), f), x), xs)
app(app(app(app(filter2, true), f), x), xs) → app(app(cons, x), app(app(filter, f), xs))
app(app(app(app(filter2, false), f), x), xs) → app(app(filter, f), xs)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

APP(app(app(app(filter2, true), f), x), xs) → APP(app(filter, f), xs)
APP(app(map, f), app(app(cons, x), xs)) → APP(f, x)
APP(app(filter, f), app(app(cons, x), xs)) → APP(app(app(app(filter2, app(f, x)), f), x), xs)
APP(app(app(app(filter2, false), f), x), xs) → APP(app(filter, f), xs)
APP(app(filter, f), app(app(cons, x), xs)) → APP(f, x)
APP(app(map, f), app(app(cons, x), xs)) → APP(app(map, f), xs)

The TRS R consists of the following rules:

app(app(., 1), x) → x
app(app(., x), 1) → x
app(app(., app(i, x)), x) → 1
app(app(., x), app(i, x)) → 1
app(app(., app(i, y)), app(app(., y), z)) → z
app(app(., y), app(app(., app(i, y)), z)) → z
app(app(., app(app(., x), y)), z) → app(app(., x), app(app(., y), z))
app(i, 1) → 1
app(i, app(i, x)) → x
app(i, app(app(., x), y)) → app(app(., app(i, y)), app(i, x))
app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(app(filter, f), nil) → nil
app(app(filter, f), app(app(cons, x), xs)) → app(app(app(app(filter2, app(f, x)), f), x), xs)
app(app(app(app(filter2, true), f), x), xs) → app(app(cons, x), app(app(filter, f), xs))
app(app(app(app(filter2, false), f), x), xs) → app(app(filter, f), xs)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

APP(app(map, f), app(app(cons, x), xs)) → APP(f, x)
APP(app(filter, f), app(app(cons, x), xs)) → APP(app(app(app(filter2, app(f, x)), f), x), xs)
APP(app(filter, f), app(app(cons, x), xs)) → APP(f, x)
APP(app(map, f), app(app(cons, x), xs)) → APP(app(map, f), xs)

The remaining pairs can at least be oriented weakly.

APP(app(app(app(filter2, true), f), x), xs) → APP(app(filter, f), xs)
APP(app(app(app(filter2, false), f), x), xs) → APP(app(filter, f), xs)

Used ordering: Combined order from the following AFS and order.
APP(x1, x2) = APP(x2)
app(x1, x2) = app(x1, x2)
filter2 = filter2
true = true
filter = filter
map = map
cons = cons
false = false
. = .
1 = 1
nil = nil
i = i

Lexicographic Path Order [19].
Precedence:

. > app₂
i > app₂

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

APP(app(app(app(filter2, true), f), x), xs) → APP(app(filter, f), xs)
APP(app(app(app(filter2, false), f), x), xs) → APP(app(filter, f), xs)

The TRS R consists of the following rules:

app(app(., 1), x) → x
app(app(., x), 1) → x
app(app(., app(i, x)), x) → 1
app(app(., x), app(i, x)) → 1
app(app(., app(i, y)), app(app(., y), z)) → z
app(app(., y), app(app(., app(i, y)), z)) → z
app(app(., app(app(., x), y)), z) → app(app(., x), app(app(., y), z))
app(i, 1) → 1
app(i, app(i, x)) → x
app(i, app(app(., x), y)) → app(app(., app(i, y)), app(i, x))
app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(app(filter, f), nil) → nil
app(app(filter, f), app(app(cons, x), xs)) → app(app(app(app(filter2, app(f, x)), f), x), xs)
app(app(app(app(filter2, true), f), x), xs) → app(app(cons, x), app(app(filter, f), xs))
app(app(app(app(filter2, false), f), x), xs) → app(app(filter, f), xs)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 0 SCCs with 2 less nodes.